Directed Feedback Vertex Set is Fixed-Parameter Tractable
نویسندگان
چکیده
We resolve positively a long standing open question regarding the fixed-parameter tractability of the parameterized Directed Feedback Vertex Set problem. In particular, we propose an algorithm which solves this problem in O(8k! ∗ poly(n)).
منابع مشابه
Directed Feedback Vertex Set Problem is FPT
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long time open problem. In this paper, we prove that the parameterized feedback vertex set in directed graph is fixed-parameter tractable and give the first FPT algorithm of running time O((1.48k)n) for it. As the feedback arc set problem in directed graph can be transformed to a feedb...
متن کاملParameterized algorithms for feedback set problems and their duals in tournaments
The parameterized feedback vertex (arc) set problem is to find whether there are k vertices (arcs) in a given graph whose removal makes the graph acyclic. The parameterized complexity of this problem in general directed graphs is a long standing open problem. We investigate the problems on tournaments, a well studied class of directed graphs. We consider both weighted and unweighted versions. W...
متن کاملGraph isomorphism parameterized by feedback vertex set number is fixed-parameter tractable
We prove that the Graph Isomorphism problem is fixed-parameter tractable when parameterized by the feedback vertex set number. That parameter is defined as the number of vertex deletions required to obtain a forest. For graphs of bounded feedback vertex set number the presented algorithm runs in time O(n), and is thereby the first fixed-parameter tractable Graph Isomorphism algorithm for a non-...
متن کاملFeedback Vertex Set in Mixed Graphs
A mixed graph is a graph with both directed and undirected edges. We present an algorithm for deciding whether a given mixed graph on n vertices contains a feedback vertex set (FVS) of size at most k, in time 2k!O(n). This is the first fixed parameter tractable algorithm for FVS that applies to both directed and undirected graphs.
متن کاملSubset Feedback Vertex Set Is Fixed-Parameter Tractable
The classical FEEDBACK VERTEX SET problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. FEEDBACK VERTEX SET has attracted a large amount of research in the parameterized setting, and subsequent kernelization and fixed-parameter algorithms have been a rich source of ideas in the field. In this paper we consider...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0707.0282 شماره
صفحات -
تاریخ انتشار 2007